Combination of Jacobi-Davidson and conjugate gradients for the partial symmetric eigenproblem
نویسنده
چکیده
To compute the smallest eigenvalues and associated eigenvectors of a real symmetric matrix, we consider the Jacobi–Davidson method with inner preconditioned conjugate gradient iterations for the arising linear systems. We show that the coe9cient matrix of these systems is indeed positive de:nite with the smallest eigenvalue bounded away from zero. We also establish a relation between the residual norm reduction in these inner linear systems and the convergence of the outer process towards the desired eigenpair. From a theoretical point of view, this allows to prove the optimality of the method, in the sense that solving the eigenproblem implies only a moderate overhead compared with solving a linear system. From a practical point of view, this allows to set up a stopping strategy for the inner iterations that minimizes this overhead by exiting precisely at the moment where further progress would be useless with respect to the convergence of the outer process. These results are numerically illustrated on some model example. Direct comparison with some other eigensolvers is also provided. Copyright ? 2001 John Wiley & Sons, Ltd.
منابع مشابه
Controlling Inner Iterations in the Jacobi-Davidson Method
The Jacobi–Davidson method is an eigenvalue solver which uses the iterative (and in general inaccurate) solution of inner linear systems to progress, in an outer iteration, towards a particular solution of the eigenproblem. In this paper we prove a relation between the residual norm of the inner linear system and the residual norm of the eigenvalue problem. We show that the latter may be estima...
متن کاملJacobi - Davidson style QR and QZ algorithmsfor the partial reduction of matrix pencilsbyDiederik
The Jacobi-Davidson subspace iteration method ooers possibilities for solving a variety of eigen-problems. In practice one has to apply restarts because of memory limitations, in order to restrict computational overhead, and also if one wants to compute several eigenvalues. In general, restarting has negative eeects on the convergence of subspace methods. We will show how eeective restarts can ...
متن کاملJacobi - Davidson Style Qr and Qz Algorithms for Thereduction of Matrix Pencilsdiederik
Recently the Jacobi-Davidson subspace iteration method has been introduced as a new powerful technique for solving a variety of eigenproblems. In this paper we will further exploit this method and enhance it with several techniques so that practical and accurate algorithms are obtained. We will present two algorithms, JDQZ for the generalized eigenproblem, and JDQR for the standard eigenproblem...
متن کاملJacobi-Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
Recently the Jacobi–Davidson subspace iteration method has been introduced as a new powerful technique for solving a variety of eigenproblems. In this paper we will further exploit this method and enhance it with several techniques so that practical and accurate algorithms are obtained. We will present two algorithms, JDQZ for the generalized eigenproblem and JDQR for the standard eigenproblem,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 9 شماره
صفحات -
تاریخ انتشار 2002